Artificial Routing Protocol for Cut Detection of Cut Vertices
نویسندگان
چکیده
منابع مشابه
Cut - Vertices and Domination In
The paper studies the domatic numbers and the total domatic numbers of graphs having cut-vertices. We shall study the domatic number d(G) and the total domatic number d t (G) of a graph G. A survey of the related theory is given in 3]. We consider nite, undirected graphs without loops or multiple edges. A subset D of the vertex set V (G) of a graph G is called dominating (total dominating), if ...
متن کاملFracture Functions from Cut Vertices
Using a generalized cut vertex expansion we introduce the concept of an extended fracture function for the description of semi-inclusive deep inelastic processes in the target fragmentation region. Extended fracture functions are shown to obey a standard homogeneous DGLAP-type equation which, upon integration over t, becomes the usual inhomogeneous evolution equation for ordinary fracture funct...
متن کاملSecure Short-Cut Routing for Mobile IP
This paper describes the architecture and implementation of a mobile IP system. It allows mobile hosts to roam between cells implemented with 2-Mbps radio base stations, while maintaining Internet connectivity. The system is being developed as part of a course on wireless networks at Harvard and has been operational since March 1994. The architecture scales well, both geographically and in the ...
متن کاملFeature Tracking for Cut Detection
Recently, investigation into shot boundary detection schemes has gathered much momentum [20-29]. Cut detection is seemingly easily solved by an elementary statistical examination of inter-frame characteristics; however a truly accurate and generalized cut detection algorithm still eludes researchers. Reliable shot boundary detection forms the cornerstone for video segmentation applications as s...
متن کاملSBV-Cut: Vertex-cut based graph partitioning using structural balance vertices
Article history: Received 6 January 2011 Received in revised form 8 November 2011 Accepted 8 November 2011 Available online 21 November 2011 Graphs are used for modeling a large spectrum of data from the web, to social connections between individuals, to concept maps and ontologies. As the number and complexities of graph based applications increase, rendering these graphs more compact, easier ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IOSR Journal of Computer Engineering
سال: 2013
ISSN: 2278-8727,2278-0661
DOI: 10.9790/0661-0910812